Finite-State Transducers in Language and Speech Processing
نویسنده
چکیده
Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-tostring transducers. Transducers that output weights also play an important role in language and speech processing.We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated.
منابع مشابه
OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language
Finite-state methods are well established in language and speech processing. OpenFst (available from www.openfst.org) is a free and open-source software library for building and using finite automata, in particular, weighted finite-state transducers (FSTs). This tutorial is an introduction to weighted finitestate transducers and their uses in speech and language processing. While there are othe...
متن کاملFinite-State Transducers
Finite-state transducers play an important role in natural language processing. They provide a model for text and speech, as well as transformations of them. In order to reduce the complexity of their application, deterministic and minimal transducers are required. This essay introduces a particular type of finite-state transducers, subsequential string-to-weight transducers, and presents algor...
متن کاملWeighted Finite-State Transducers in Speech and Natural Language Processing Solution Set 7: Final Examination
متن کامل
Applying Transducers to Spoken Language Processing for Portuguese
This paper has two different goals. The primary aim is to illustrate the advantages of weighted finite state transducers for spoken language processing, namely in terms of their capacity to efficiently integrate different types of knowledge sources. We have chosen three areas to emphasize several aspects of the application of transducers: large vocabulary continuous speech recognition, automati...
متن کاملSpoken Language Processing Using Weighted Finite State Transducers
The main goal of this paper is to illustrate the advantages of weighted finite state transducers (WFSTs) for spoken language processing, namely in terms of their capacity to efficiently integrate different types of knowledge sources. We shall illustrate their applicability in several areas: large vocabulary continuous speech recognition, automatic alignment using pronunciation modeling rules, g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Linguistics
دوره 23 شماره
صفحات -
تاریخ انتشار 1997